A New Approach Based on K-means Clustering and Shuffled Frog Leaping Algorithm to Solve Travelling Salesman Problem
نویسندگان
چکیده
منابع مشابه
A New Method Based On Modified Shuffled Frog Leaping Algorithm In Order To Solve Nonlinear Large Scale Problem
In order to handle large scale problems, this study has used shuffled frog leaping algorithm. This algorithm is an optimization method based on natural memetics that uses a new two-phase modification to it to have a better search in the problem space. The suggested algorithm is evaluated by comparing to some well known algorithms using several benchmark optimization problems. The simulation res...
متن کاملA Study of Genetic Algorithm to Solve Travelling Salesman Problem
This paper presents the literature survey review of Travelling Salesman Problem (TSP). TSP belongs to the category of NP-hard problems. A various number of methods have been designed to solve this problem. Genetic Algorithm is one of the best methods which is used to solve various NP-hard problem such as TSP. The natural evolution process is always used by genetic Algorithm to solve the problem...
متن کاملShuffled frog leaping algorithm based on enhanced learning
The paper proposes shuffled frog leaping algorithm (SFLA) based on enhanced learning, which generates a virtual general centre frog that is related to the optimal frog of each memeplex. The algorithm can utilise the superior information of each memeplex, enhance the mutual learning and use the average centre of optimal frog. In the processing of evolution, the optimal frog of sub-memeplex learn...
متن کاملAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
Shuffled frog-leaping algorithm (SFLA) has long been considered as new evolutionary algorithm of group evolution, and has a high computing performance and excellent ability for global search. Knapsack problem is a typical NP-complete problem. For the discrete search space, this paper presents the improved SFLA (ISFLA), and solves the knapsack problem by using the algorithm. Experimental results...
متن کاملCentroid Mutation Embedded Shuffled Frog-Leaping Algorithm
Stochastic search algorithms that take their inspiration from nature are gaining a great attention of many researchers to solve high dimension and non – linear complex optimization problems for which traditional methods fails. Shuffled frog – leaping algorithm (SFLA) is recent addition to the family of stochastic search algorithms that take its inspiration from the foraging process of frogs. SF...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Academic Perspective Procedia
سال: 2019
ISSN: 2667-5862
DOI: 10.33793/acperpro.02.03.31